A Systolic Array for Recursive Least Squares Computations - Part II : Mapping directionally weighted RLS on an SVD updating array

نویسنده

  • Marc Moonen
چکیده

In an earlier paper, a systolic algorithm/array was derived for recursive least squares (RLS) estimation, which achieves an O(n0) throughput rate with O(n2) parallelism. The resulting array is specifically tuned towards the RLS problem. Here, a different route is taken, by trying to implement the RLS problem on a systolic array, which is also useful for several other applications, such as, e.g., SVD updating and Kalman filtering. This is important in view of possible hardware implementation. An additional advantage is that, unlike with the earlier array, it is now possible to incorporate alternative data weighting strategies such as directional weighting, without sacrificing speed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A systolic array for recursive least squares computations: mapping directionally weighted RLS on an SVD updating array

The original recursive least squares (RLS) computational scheme basically consists of triangular updates and triangular backsolves, and it is well known that pipelining these two separate steps on a parallel architecture as such is impossible. As a result of this, a straightforward systolic implementation with, e.g. O(n 2 ) processors for O(n 2 ) operations per update, will have a throughput wh...

متن کامل

Systolic MVDR Beamforming with Inverse Updating

In this report, a stable alternative is described for the `standard' systolic MVDR beamforming algorithm of McWhirter and Shepherd, which is known to su er from numerical instability. The alternative algorithm is similar to covariance-type recursive least squares algorithms, and is therefore readily implemented on an RLS systolic array.

متن کامل

Systolic block Householder transformation for RLS algorithm with two-level pipelined implementation

The QR decomposition, recursive least squares (QRD RLS) algorithm is one of the most promising RLS algorithms, due to its robust numerical stability and suitability for VLSI implementation based on a systolic array architecture. Up to now, among many techniques to implement the QR decomposition, only the Givens rotation and modified GramSchmidt methods have been successfully applied to the deve...

متن کامل

Low Complexity and High speed in Leading DCD ERLS Algorithm

Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...

متن کامل

A fully pipelined RLS-based array for channel equalization

It is shown that several recursive least squares (RLS) type equalization algorithms such as, e.g., decision-directed schemes and ‘orthogonalized’ constant modulus algorithms, possess a common algorithmic structure and are therefore rather straightforwardly implemented on an triangular array (filter structure) for RLS estimation with inverse updating. While the computational complexity for such ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993